./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.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 06f1e7cb4ad4b39445b3c30d820384fbedafa8e52cac3d3c0cb4d178fb229699 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:27:08,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:27:08,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:27:08,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:27:08,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:27:08,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:27:08,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:27:08,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:27:08,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:27:08,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:27:08,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:27:08,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:27:08,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:27:08,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:27:08,345 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:27:08,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:27:08,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:27:08,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:27:08,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:27:08,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:27:08,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:27:08,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:27:08,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:27:08,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:27:08,346 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:27:08,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:27:08,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:27:08,346 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:27:08,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:27:08,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:27:08,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:27:08,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:27:08,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:27:08,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:27:08,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:27:08,348 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:27:08,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:27:08,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:27:08,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:27:08,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:27:08,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:27:08,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:27:08,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:27:08,348 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 -> 06f1e7cb4ad4b39445b3c30d820384fbedafa8e52cac3d3c0cb4d178fb229699 [2025-03-08 06:27:08,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:27:08,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:27:08,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:27:08,590 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:27:08,590 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:27:08,592 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.UNBOUNDED.pals.c.p+lhb-reducer.c [2025-03-08 06:27:09,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f94b2f6/14f2994dfa1a4cb49520f7fc95a3528b/FLAG86666298b [2025-03-08 06:27:10,133 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:27:10,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2025-03-08 06:27:10,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f94b2f6/14f2994dfa1a4cb49520f7fc95a3528b/FLAG86666298b [2025-03-08 06:27:10,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f94b2f6/14f2994dfa1a4cb49520f7fc95a3528b [2025-03-08 06:27:10,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:27:10,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:27:10,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:27:10,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:27:10,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:27:10,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c499a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10, skipping insertion in model container [2025-03-08 06:27:10,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:27:10,417 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.UNBOUNDED.pals.c.p+lhb-reducer.c[11714,11727] [2025-03-08 06:27:10,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:27:10,472 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:27:10,580 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.UNBOUNDED.pals.c.p+lhb-reducer.c[11714,11727] [2025-03-08 06:27:10,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:27:10,646 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:27:10,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10 WrapperNode [2025-03-08 06:27:10,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:27:10,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:27:10,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:27:10,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:27:10,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,701 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1037 [2025-03-08 06:27:10,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:27:10,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:27:10,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:27:10,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:27:10,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,752 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:27:10,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,768 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:27:10,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:27:10,783 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:27:10,783 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:27:10,787 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (1/1) ... [2025-03-08 06:27:10,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:27:10,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:27:10,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:27:10,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:27:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:27:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:27:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:27:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:27:10,932 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:27:10,933 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:27:11,610 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1159: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:27:11,610 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: havoc main_~node6__m6~0#1; [2025-03-08 06:27:11,610 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L467: havoc main_~node6__m6~1#1; [2025-03-08 06:27:11,610 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1426: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-08 06:27:11,610 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L601: havoc main_~node6__m6~2#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: havoc main_~node4__m4~0#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L437: havoc main_~node4__m4~1#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L802: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc main_~node4__m4~2#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L274: havoc main_~node2__m2~0#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node2__m2~1#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: havoc main_~node2__m2~2#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1336: havoc main_~node6____CPAchecker_TMP_0~2#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1204: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1471: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L943: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L847: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L319: havoc main_~node5__m5~0#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L452: havoc main_~node5__m5~1#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L254: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L387: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:27:11,611 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1114: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:27:11,612 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L586: havoc main_~node5__m5~2#1; [2025-03-08 06:27:11,612 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L289: havoc main_~node3__m3~0#1; [2025-03-08 06:27:11,612 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-08 06:27:11,612 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L422: havoc main_~node3__m3~1#1; [2025-03-08 06:27:11,612 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1381: havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-03-08 06:27:11,612 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L556: havoc main_~node3__m3~2#1; [2025-03-08 06:27:11,612 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1516: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-08 06:27:11,612 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L757: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-08 06:27:11,612 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:27:11,612 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-08 06:27:11,612 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L892: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:27:11,663 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-08 06:27:11,663 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:27:11,676 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:27:11,676 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:27:11,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:27:11 BoogieIcfgContainer [2025-03-08 06:27:11,676 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:27:11,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:27:11,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:27:11,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:27:11,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:27:10" (1/3) ... [2025-03-08 06:27:11,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d0b0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:27:11, skipping insertion in model container [2025-03-08 06:27:11,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:27:10" (2/3) ... [2025-03-08 06:27:11,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d0b0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:27:11, skipping insertion in model container [2025-03-08 06:27:11,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:27:11" (3/3) ... [2025-03-08 06:27:11,684 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2025-03-08 06:27:11,697 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:27:11,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c that has 1 procedures, 257 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:27:11,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:27:11,759 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;@390d73d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:27:11,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:27:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 255 states have (on average 1.6705882352941177) internal successors, (426), 256 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:27:11,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:11,771 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] [2025-03-08 06:27:11,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:11,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash -708833910, now seen corresponding path program 1 times [2025-03-08 06:27:11,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:11,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86063100] [2025-03-08 06:27:11,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:11,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:11,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:27:11,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:27:11,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:11,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:12,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:12,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86063100] [2025-03-08 06:27:12,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86063100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:12,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:12,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:27:12,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086264694] [2025-03-08 06:27:12,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:12,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:27:12,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:12,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:27:12,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:27:12,211 INFO L87 Difference]: Start difference. First operand has 257 states, 255 states have (on average 1.6705882352941177) internal successors, (426), 256 states have internal predecessors, (426), 0 states have call successors, (0), 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 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:12,301 INFO L93 Difference]: Finished difference Result 472 states and 770 transitions. [2025-03-08 06:27:12,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:27:12,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-08 06:27:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:12,309 INFO L225 Difference]: With dead ends: 472 [2025-03-08 06:27:12,310 INFO L226 Difference]: Without dead ends: 254 [2025-03-08 06:27:12,312 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-08 06:27:12,314 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 0 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:12,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1223 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:27:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-08 06:27:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-03-08 06:27:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.5019762845849802) internal successors, (380), 253 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2025-03-08 06:27:12,347 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 91 [2025-03-08 06:27:12,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:12,348 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2025-03-08 06:27:12,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2025-03-08 06:27:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 06:27:12,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:12,371 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] [2025-03-08 06:27:12,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:27:12,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:12,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:12,372 INFO L85 PathProgramCache]: Analyzing trace with hash -527949876, now seen corresponding path program 1 times [2025-03-08 06:27:12,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:12,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965037242] [2025-03-08 06:27:12,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:12,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:12,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 06:27:12,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 06:27:12,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:12,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:12,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:12,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965037242] [2025-03-08 06:27:12,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965037242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:12,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:12,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:12,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143259610] [2025-03-08 06:27:12,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:12,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:12,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:12,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:12,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:12,540 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:12,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:12,585 INFO L93 Difference]: Finished difference Result 555 states and 860 transitions. [2025-03-08 06:27:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:12,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-08 06:27:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:12,588 INFO L225 Difference]: With dead ends: 555 [2025-03-08 06:27:12,589 INFO L226 Difference]: Without dead ends: 362 [2025-03-08 06:27:12,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:12,590 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 207 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:12,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 662 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-08 06:27:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2025-03-08 06:27:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.5264623955431755) internal successors, (548), 359 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 548 transitions. [2025-03-08 06:27:12,605 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 548 transitions. Word has length 130 [2025-03-08 06:27:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:12,605 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 548 transitions. [2025-03-08 06:27:12,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 548 transitions. [2025-03-08 06:27:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:27:12,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:12,607 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] [2025-03-08 06:27:12,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:27:12,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:12,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1313822733, now seen corresponding path program 1 times [2025-03-08 06:27:12,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:12,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822344837] [2025-03-08 06:27:12,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:12,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:12,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:27:12,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:27:12,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:12,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:12,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:12,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822344837] [2025-03-08 06:27:12,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822344837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:12,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:12,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:12,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163295938] [2025-03-08 06:27:12,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:12,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:12,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:12,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:12,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:12,738 INFO L87 Difference]: Start difference. First operand 360 states and 548 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:12,771 INFO L93 Difference]: Finished difference Result 843 states and 1319 transitions. [2025-03-08 06:27:12,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:12,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-08 06:27:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:12,775 INFO L225 Difference]: With dead ends: 843 [2025-03-08 06:27:12,776 INFO L226 Difference]: Without dead ends: 550 [2025-03-08 06:27:12,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:12,779 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 194 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:12,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 642 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-08 06:27:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2025-03-08 06:27:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.546617915904936) internal successors, (846), 547 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 846 transitions. [2025-03-08 06:27:12,795 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 846 transitions. Word has length 132 [2025-03-08 06:27:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:12,795 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 846 transitions. [2025-03-08 06:27:12,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 846 transitions. [2025-03-08 06:27:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 06:27:12,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:12,797 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] [2025-03-08 06:27:12,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:27:12,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:12,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:12,798 INFO L85 PathProgramCache]: Analyzing trace with hash -107836462, now seen corresponding path program 1 times [2025-03-08 06:27:12,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:12,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447389082] [2025-03-08 06:27:12,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:12,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:12,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:27:12,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:27:12,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:12,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:12,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:12,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447389082] [2025-03-08 06:27:12,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447389082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:12,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:12,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:12,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927671540] [2025-03-08 06:27:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:12,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:12,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:12,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:12,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:12,926 INFO L87 Difference]: Start difference. First operand 548 states and 846 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:12,962 INFO L93 Difference]: Finished difference Result 1349 states and 2123 transitions. [2025-03-08 06:27:12,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:12,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-08 06:27:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:12,969 INFO L225 Difference]: With dead ends: 1349 [2025-03-08 06:27:12,969 INFO L226 Difference]: Without dead ends: 874 [2025-03-08 06:27:12,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:12,970 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 181 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:12,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 669 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-08 06:27:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2025-03-08 06:27:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 871 states have (on average 1.5591274397244546) internal successors, (1358), 871 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1358 transitions. [2025-03-08 06:27:13,002 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1358 transitions. Word has length 134 [2025-03-08 06:27:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:13,002 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1358 transitions. [2025-03-08 06:27:13,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1358 transitions. [2025-03-08 06:27:13,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 06:27:13,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:13,004 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] [2025-03-08 06:27:13,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:27:13,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:13,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1626154917, now seen corresponding path program 1 times [2025-03-08 06:27:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:13,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216408160] [2025-03-08 06:27:13,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:13,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:13,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 06:27:13,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 06:27:13,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:13,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:13,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:13,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216408160] [2025-03-08 06:27:13,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216408160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:13,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:13,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:13,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440793691] [2025-03-08 06:27:13,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:13,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:13,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:13,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:13,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:13,114 INFO L87 Difference]: Start difference. First operand 872 states and 1358 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:13,149 INFO L93 Difference]: Finished difference Result 2207 states and 3479 transitions. [2025-03-08 06:27:13,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:13,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-03-08 06:27:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:13,158 INFO L225 Difference]: With dead ends: 2207 [2025-03-08 06:27:13,158 INFO L226 Difference]: Without dead ends: 1414 [2025-03-08 06:27:13,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:13,160 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 168 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:13,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 602 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-08 06:27:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1412. [2025-03-08 06:27:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1411 states have (on average 1.56343019135365) internal successors, (2206), 1411 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2206 transitions. [2025-03-08 06:27:13,193 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2206 transitions. Word has length 136 [2025-03-08 06:27:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:13,194 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2206 transitions. [2025-03-08 06:27:13,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2206 transitions. [2025-03-08 06:27:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 06:27:13,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:13,202 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] [2025-03-08 06:27:13,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:27:13,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:13,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:13,202 INFO L85 PathProgramCache]: Analyzing trace with hash 813075370, now seen corresponding path program 1 times [2025-03-08 06:27:13,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:13,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140386141] [2025-03-08 06:27:13,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:13,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:13,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 06:27:13,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 06:27:13,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:13,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:13,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:13,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140386141] [2025-03-08 06:27:13,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140386141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:13,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:13,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712756500] [2025-03-08 06:27:13,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:13,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:13,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:13,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:13,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:13,358 INFO L87 Difference]: Start difference. First operand 1412 states and 2206 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:13,394 INFO L93 Difference]: Finished difference Result 3601 states and 5663 transitions. [2025-03-08 06:27:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:13,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-08 06:27:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:13,401 INFO L225 Difference]: With dead ends: 3601 [2025-03-08 06:27:13,401 INFO L226 Difference]: Without dead ends: 2274 [2025-03-08 06:27:13,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:13,403 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 155 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:13,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 597 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2025-03-08 06:27:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2272. [2025-03-08 06:27:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.5596653456627037) internal successors, (3542), 2271 states have internal predecessors, (3542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3542 transitions. [2025-03-08 06:27:13,444 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3542 transitions. Word has length 138 [2025-03-08 06:27:13,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:13,444 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 3542 transitions. [2025-03-08 06:27:13,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3542 transitions. [2025-03-08 06:27:13,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 06:27:13,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:13,448 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] [2025-03-08 06:27:13,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:27:13,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:13,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1152020921, now seen corresponding path program 1 times [2025-03-08 06:27:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:13,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091446951] [2025-03-08 06:27:13,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:13,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:13,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 06:27:13,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 06:27:13,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:13,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:13,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-08 06:27:13,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091446951] [2025-03-08 06:27:13,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091446951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:13,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:13,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:13,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580150630] [2025-03-08 06:27:13,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:13,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:27:13,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:13,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:27:13,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:27:13,679 INFO L87 Difference]: Start difference. First operand 2272 states and 3542 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:14,340 INFO L93 Difference]: Finished difference Result 24689 states and 38597 transitions. [2025-03-08 06:27:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:14,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-03-08 06:27:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:14,410 INFO L225 Difference]: With dead ends: 24689 [2025-03-08 06:27:14,410 INFO L226 Difference]: Without dead ends: 22508 [2025-03-08 06:27:14,422 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-08 06:27:14,422 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 2519 mSDsluCounter, 5134 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2519 SdHoareTripleChecker+Valid, 5931 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:14,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2519 Valid, 5931 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:27:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22508 states. [2025-03-08 06:27:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22508 to 4488. [2025-03-08 06:27:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4488 states, 4487 states have (on average 1.53599286828616) internal successors, (6892), 4487 states have internal predecessors, (6892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6892 transitions. [2025-03-08 06:27:14,687 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6892 transitions. Word has length 140 [2025-03-08 06:27:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:14,688 INFO L471 AbstractCegarLoop]: Abstraction has 4488 states and 6892 transitions. [2025-03-08 06:27:14,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6892 transitions. [2025-03-08 06:27:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:27:14,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:14,697 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] [2025-03-08 06:27:14,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:27:14,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:14,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1351870091, now seen corresponding path program 1 times [2025-03-08 06:27:14,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:14,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237031733] [2025-03-08 06:27:14,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:14,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:27:14,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:27:14,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:14,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:14,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:14,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237031733] [2025-03-08 06:27:14,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237031733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:14,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:14,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:14,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553340381] [2025-03-08 06:27:14,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:14,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:14,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:14,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:14,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:14,811 INFO L87 Difference]: Start difference. First operand 4488 states and 6892 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:14,865 INFO L93 Difference]: Finished difference Result 12513 states and 19228 transitions. [2025-03-08 06:27:14,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:14,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-03-08 06:27:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:14,880 INFO L225 Difference]: With dead ends: 12513 [2025-03-08 06:27:14,880 INFO L226 Difference]: Without dead ends: 8074 [2025-03-08 06:27:14,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:14,887 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 205 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:14,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 777 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:14,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2025-03-08 06:27:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2025-03-08 06:27:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8072 states, 8071 states have (on average 1.5267005327716516) internal successors, (12322), 8071 states have internal predecessors, (12322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 12322 transitions. [2025-03-08 06:27:15,022 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 12322 transitions. Word has length 143 [2025-03-08 06:27:15,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:15,022 INFO L471 AbstractCegarLoop]: Abstraction has 8072 states and 12322 transitions. [2025-03-08 06:27:15,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 12322 transitions. [2025-03-08 06:27:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:27:15,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:15,036 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] [2025-03-08 06:27:15,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:27:15,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:15,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:15,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1727984276, now seen corresponding path program 1 times [2025-03-08 06:27:15,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:15,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011869699] [2025-03-08 06:27:15,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:15,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:15,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:27:15,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:27:15,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:15,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:15,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:15,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011869699] [2025-03-08 06:27:15,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011869699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:15,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:15,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546758388] [2025-03-08 06:27:15,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:15,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:15,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:15,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:15,144 INFO L87 Difference]: Start difference. First operand 8072 states and 12322 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:15,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:15,206 INFO L93 Difference]: Finished difference Result 18816 states and 28711 transitions. [2025-03-08 06:27:15,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:15,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-03-08 06:27:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:15,222 INFO L225 Difference]: With dead ends: 18816 [2025-03-08 06:27:15,223 INFO L226 Difference]: Without dead ends: 10827 [2025-03-08 06:27:15,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:15,232 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 223 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:15,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 516 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10827 states. [2025-03-08 06:27:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10827 to 10761. [2025-03-08 06:27:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10761 states, 10760 states have (on average 1.5021375464684015) internal successors, (16163), 10760 states have internal predecessors, (16163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 16163 transitions. [2025-03-08 06:27:15,469 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 16163 transitions. Word has length 144 [2025-03-08 06:27:15,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:15,469 INFO L471 AbstractCegarLoop]: Abstraction has 10761 states and 16163 transitions. [2025-03-08 06:27:15,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 16163 transitions. [2025-03-08 06:27:15,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:27:15,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:15,485 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] [2025-03-08 06:27:15,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:27:15,485 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:15,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:15,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1841463269, now seen corresponding path program 1 times [2025-03-08 06:27:15,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:15,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144545714] [2025-03-08 06:27:15,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:15,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:15,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:27:15,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:27:15,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:15,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:15,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:15,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144545714] [2025-03-08 06:27:15,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144545714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:15,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:15,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:15,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372073504] [2025-03-08 06:27:15,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:15,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:27:15,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:15,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:27:15,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:27:15,813 INFO L87 Difference]: Start difference. First operand 10761 states and 16163 transitions. Second operand has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:16,146 INFO L93 Difference]: Finished difference Result 21440 states and 32230 transitions. [2025-03-08 06:27:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:27:16,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-03-08 06:27:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:16,165 INFO L225 Difference]: With dead ends: 21440 [2025-03-08 06:27:16,166 INFO L226 Difference]: Without dead ends: 10763 [2025-03-08 06:27:16,178 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-08 06:27:16,178 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 1402 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:16,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 1389 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:27:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10763 states. [2025-03-08 06:27:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10763 to 10761. [2025-03-08 06:27:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10761 states, 10760 states have (on average 1.4871747211895912) internal successors, (16002), 10760 states have internal predecessors, (16002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 16002 transitions. [2025-03-08 06:27:16,401 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 16002 transitions. Word has length 144 [2025-03-08 06:27:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:16,401 INFO L471 AbstractCegarLoop]: Abstraction has 10761 states and 16002 transitions. [2025-03-08 06:27:16,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 16002 transitions. [2025-03-08 06:27:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 06:27:16,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:16,417 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] [2025-03-08 06:27:16,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:27:16,417 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:16,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:16,419 INFO L85 PathProgramCache]: Analyzing trace with hash 747075984, now seen corresponding path program 1 times [2025-03-08 06:27:16,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:16,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711714170] [2025-03-08 06:27:16,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:16,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:16,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 06:27:16,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 06:27:16,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:16,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:16,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:16,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711714170] [2025-03-08 06:27:16,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711714170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:16,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:16,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976863428] [2025-03-08 06:27:16,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:16,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:27:16,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:16,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:27:16,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:27:16,655 INFO L87 Difference]: Start difference. First operand 10761 states and 16002 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:17,053 INFO L93 Difference]: Finished difference Result 66006 states and 98330 transitions. [2025-03-08 06:27:17,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:27:17,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-03-08 06:27:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:17,158 INFO L225 Difference]: With dead ends: 66006 [2025-03-08 06:27:17,158 INFO L226 Difference]: Without dead ends: 57396 [2025-03-08 06:27:17,175 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-08 06:27:17,176 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 2034 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:17,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 2476 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57396 states. [2025-03-08 06:27:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57396 to 19970. [2025-03-08 06:27:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19970 states, 19969 states have (on average 1.4813460864339727) internal successors, (29581), 19969 states have internal predecessors, (29581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19970 states to 19970 states and 29581 transitions. [2025-03-08 06:27:17,733 INFO L78 Accepts]: Start accepts. Automaton has 19970 states and 29581 transitions. Word has length 145 [2025-03-08 06:27:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:17,734 INFO L471 AbstractCegarLoop]: Abstraction has 19970 states and 29581 transitions. [2025-03-08 06:27:17,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 19970 states and 29581 transitions. [2025-03-08 06:27:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 06:27:17,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:17,763 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] [2025-03-08 06:27:17,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:27:17,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:17,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash 500081304, now seen corresponding path program 1 times [2025-03-08 06:27:17,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070136835] [2025-03-08 06:27:17,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:17,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:17,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 06:27:17,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 06:27:17,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:17,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:18,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:18,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070136835] [2025-03-08 06:27:18,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070136835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:18,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:18,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:18,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812948027] [2025-03-08 06:27:18,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:18,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:27:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:18,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:27:18,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:27:18,008 INFO L87 Difference]: Start difference. First operand 19970 states and 29581 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:18,353 INFO L93 Difference]: Finished difference Result 74898 states and 111462 transitions. [2025-03-08 06:27:18,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:27:18,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-03-08 06:27:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:18,466 INFO L225 Difference]: With dead ends: 74898 [2025-03-08 06:27:18,466 INFO L226 Difference]: Without dead ends: 66288 [2025-03-08 06:27:18,492 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-08 06:27:18,493 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 2061 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:18,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2061 Valid, 2590 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66288 states. [2025-03-08 06:27:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66288 to 33272. [2025-03-08 06:27:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33272 states, 33271 states have (on average 1.4759099516095098) internal successors, (49105), 33271 states have internal predecessors, (49105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 49105 transitions. [2025-03-08 06:27:19,095 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 49105 transitions. Word has length 145 [2025-03-08 06:27:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:19,096 INFO L471 AbstractCegarLoop]: Abstraction has 33272 states and 49105 transitions. [2025-03-08 06:27:19,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 49105 transitions. [2025-03-08 06:27:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 06:27:19,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:19,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:19,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:27:19,125 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:19,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash 583480136, now seen corresponding path program 1 times [2025-03-08 06:27:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:19,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483795887] [2025-03-08 06:27:19,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:19,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 06:27:19,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 06:27:19,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:19,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:19,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:19,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483795887] [2025-03-08 06:27:19,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483795887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:19,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:19,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:19,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675295429] [2025-03-08 06:27:19,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:19,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:27:19,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:19,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:27:19,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:27:19,335 INFO L87 Difference]: Start difference. First operand 33272 states and 49105 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:19,703 INFO L93 Difference]: Finished difference Result 83626 states and 124350 transitions. [2025-03-08 06:27:19,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:27:19,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-03-08 06:27:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:19,787 INFO L225 Difference]: With dead ends: 83626 [2025-03-08 06:27:19,787 INFO L226 Difference]: Without dead ends: 75016 [2025-03-08 06:27:19,815 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-08 06:27:19,816 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 2035 mSDsluCounter, 2084 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:19,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2035 Valid, 2673 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75016 states. [2025-03-08 06:27:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75016 to 42309. [2025-03-08 06:27:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42309 states, 42308 states have (on average 1.4761747187293184) internal successors, (62454), 42308 states have internal predecessors, (62454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42309 states to 42309 states and 62454 transitions. [2025-03-08 06:27:20,599 INFO L78 Accepts]: Start accepts. Automaton has 42309 states and 62454 transitions. Word has length 145 [2025-03-08 06:27:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:20,600 INFO L471 AbstractCegarLoop]: Abstraction has 42309 states and 62454 transitions. [2025-03-08 06:27:20,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 42309 states and 62454 transitions. [2025-03-08 06:27:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 06:27:20,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:20,638 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] [2025-03-08 06:27:20,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:27:20,638 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:20,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash 343515146, now seen corresponding path program 1 times [2025-03-08 06:27:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:20,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529375125] [2025-03-08 06:27:20,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:20,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:20,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 06:27:20,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 06:27:20,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:20,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:20,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:20,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529375125] [2025-03-08 06:27:20,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529375125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:20,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:20,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:20,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296259417] [2025-03-08 06:27:20,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:20,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:27:20,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:20,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:27:20,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:27:20,918 INFO L87 Difference]: Start difference. First operand 42309 states and 62454 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:21,436 INFO L93 Difference]: Finished difference Result 92636 states and 137664 transitions. [2025-03-08 06:27:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:27:21,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-03-08 06:27:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:21,554 INFO L225 Difference]: With dead ends: 92636 [2025-03-08 06:27:21,554 INFO L226 Difference]: Without dead ends: 84026 [2025-03-08 06:27:21,596 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-08 06:27:21,597 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 2082 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:21,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2082 Valid, 2774 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84026 states. [2025-03-08 06:27:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84026 to 51436. [2025-03-08 06:27:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51436 states, 51435 states have (on average 1.4766793039758919) internal successors, (75953), 51435 states have internal predecessors, (75953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51436 states to 51436 states and 75953 transitions. [2025-03-08 06:27:22,487 INFO L78 Accepts]: Start accepts. Automaton has 51436 states and 75953 transitions. Word has length 145 [2025-03-08 06:27:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:22,487 INFO L471 AbstractCegarLoop]: Abstraction has 51436 states and 75953 transitions. [2025-03-08 06:27:22,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 51436 states and 75953 transitions. [2025-03-08 06:27:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 06:27:22,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:22,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:22,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:27:22,518 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:22,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash 724911400, now seen corresponding path program 1 times [2025-03-08 06:27:22,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:22,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50351269] [2025-03-08 06:27:22,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:22,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:22,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 06:27:22,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 06:27:22,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:22,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:22,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:22,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50351269] [2025-03-08 06:27:22,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50351269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:22,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:22,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:22,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621236517] [2025-03-08 06:27:22,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:22,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:27:22,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:22,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:27:22,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:27:22,704 INFO L87 Difference]: Start difference. First operand 51436 states and 75953 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:23,122 INFO L93 Difference]: Finished difference Result 101723 states and 151099 transitions. [2025-03-08 06:27:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:27:23,123 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-03-08 06:27:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:23,225 INFO L225 Difference]: With dead ends: 101723 [2025-03-08 06:27:23,225 INFO L226 Difference]: Without dead ends: 93113 [2025-03-08 06:27:23,258 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-08 06:27:23,258 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 2242 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2242 SdHoareTripleChecker+Valid, 2811 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:23,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2242 Valid, 2811 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93113 states. [2025-03-08 06:27:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93113 to 60572. [2025-03-08 06:27:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60572 states, 60571 states have (on average 1.477059979197966) internal successors, (89467), 60571 states have internal predecessors, (89467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60572 states to 60572 states and 89467 transitions. [2025-03-08 06:27:24,433 INFO L78 Accepts]: Start accepts. Automaton has 60572 states and 89467 transitions. Word has length 145 [2025-03-08 06:27:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:24,434 INFO L471 AbstractCegarLoop]: Abstraction has 60572 states and 89467 transitions. [2025-03-08 06:27:24,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 60572 states and 89467 transitions. [2025-03-08 06:27:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 06:27:24,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:24,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:24,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:27:24,479 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:24,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1162810195, now seen corresponding path program 1 times [2025-03-08 06:27:24,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:24,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656519267] [2025-03-08 06:27:24,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:24,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:24,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 06:27:24,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 06:27:24,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:24,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:24,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:24,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656519267] [2025-03-08 06:27:24,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656519267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:24,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:24,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:24,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116532404] [2025-03-08 06:27:24,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:24,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:27:24,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:24,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:27:24,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:27:24,749 INFO L87 Difference]: Start difference. First operand 60572 states and 89467 transitions. Second operand has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:25,278 INFO L93 Difference]: Finished difference Result 105336 states and 156590 transitions. [2025-03-08 06:27:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:27:25,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-03-08 06:27:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:25,405 INFO L225 Difference]: With dead ends: 105336 [2025-03-08 06:27:25,405 INFO L226 Difference]: Without dead ends: 99510 [2025-03-08 06:27:25,439 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-08 06:27:25,440 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2255 mSDsluCounter, 2112 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2255 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:25,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2255 Valid, 2632 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99510 states. [2025-03-08 06:27:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99510 to 66969. [2025-03-08 06:27:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66969 states, 66968 states have (on average 1.4791243579022817) internal successors, (99054), 66968 states have internal predecessors, (99054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66969 states to 66969 states and 99054 transitions. [2025-03-08 06:27:26,654 INFO L78 Accepts]: Start accepts. Automaton has 66969 states and 99054 transitions. Word has length 146 [2025-03-08 06:27:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:26,655 INFO L471 AbstractCegarLoop]: Abstraction has 66969 states and 99054 transitions. [2025-03-08 06:27:26,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:26,655 INFO L276 IsEmpty]: Start isEmpty. Operand 66969 states and 99054 transitions. [2025-03-08 06:27:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 06:27:26,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:26,692 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-08 06:27:26,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:27:26,692 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:26,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1421197844, now seen corresponding path program 1 times [2025-03-08 06:27:26,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:26,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829008273] [2025-03-08 06:27:26,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:26,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:26,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 06:27:26,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 06:27:26,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:26,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:26,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:26,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829008273] [2025-03-08 06:27:26,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829008273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:26,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:26,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:26,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158926165] [2025-03-08 06:27:26,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:26,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:26,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:26,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:26,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:26,755 INFO L87 Difference]: Start difference. First operand 66969 states and 99054 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:27,590 INFO L93 Difference]: Finished difference Result 196489 states and 290195 transitions. [2025-03-08 06:27:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:27,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2025-03-08 06:27:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:27,755 INFO L225 Difference]: With dead ends: 196489 [2025-03-08 06:27:27,756 INFO L226 Difference]: Without dead ends: 132994 [2025-03-08 06:27:27,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:27,802 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 198 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:27,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 387 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132994 states. [2025-03-08 06:27:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132994 to 132992. [2025-03-08 06:27:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132992 states, 132991 states have (on average 1.4690242196840388) internal successors, (195367), 132991 states have internal predecessors, (195367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132992 states to 132992 states and 195367 transitions. [2025-03-08 06:27:29,760 INFO L78 Accepts]: Start accepts. Automaton has 132992 states and 195367 transitions. Word has length 147 [2025-03-08 06:27:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:29,760 INFO L471 AbstractCegarLoop]: Abstraction has 132992 states and 195367 transitions. [2025-03-08 06:27:29,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 132992 states and 195367 transitions. [2025-03-08 06:27:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 06:27:29,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:29,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] [2025-03-08 06:27:29,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:27:29,837 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:29,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:29,837 INFO L85 PathProgramCache]: Analyzing trace with hash 23678323, now seen corresponding path program 1 times [2025-03-08 06:27:29,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:29,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041003655] [2025-03-08 06:27:29,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:29,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:29,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 06:27:29,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 06:27:29,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:29,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:29,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041003655] [2025-03-08 06:27:29,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041003655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:29,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:29,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:29,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093864395] [2025-03-08 06:27:29,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:29,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:29,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:29,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:29,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:29,959 INFO L87 Difference]: Start difference. First operand 132992 states and 195367 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:30,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:30,530 INFO L93 Difference]: Finished difference Result 218916 states and 323529 transitions. [2025-03-08 06:27:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:30,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2025-03-08 06:27:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:30,619 INFO L225 Difference]: With dead ends: 218916 [2025-03-08 06:27:30,620 INFO L226 Difference]: Without dead ends: 92821 [2025-03-08 06:27:30,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:30,682 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 130 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:30,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 554 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92821 states. [2025-03-08 06:27:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92821 to 92819. [2025-03-08 06:27:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92819 states, 92818 states have (on average 1.4802085802322826) internal successors, (137390), 92818 states have internal predecessors, (137390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92819 states to 92819 states and 137390 transitions. [2025-03-08 06:27:31,877 INFO L78 Accepts]: Start accepts. Automaton has 92819 states and 137390 transitions. Word has length 147 [2025-03-08 06:27:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:31,878 INFO L471 AbstractCegarLoop]: Abstraction has 92819 states and 137390 transitions. [2025-03-08 06:27:31,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 92819 states and 137390 transitions. [2025-03-08 06:27:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 06:27:31,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:31,924 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] [2025-03-08 06:27:31,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:27:31,924 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:31,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:31,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1178909624, now seen corresponding path program 1 times [2025-03-08 06:27:31,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:31,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160507022] [2025-03-08 06:27:31,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:31,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:31,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 06:27:31,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 06:27:31,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:31,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:32,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:32,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160507022] [2025-03-08 06:27:32,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160507022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:32,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:32,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:32,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149549319] [2025-03-08 06:27:32,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:32,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:32,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:32,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:32,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:32,065 INFO L87 Difference]: Start difference. First operand 92819 states and 137390 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:32,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:32,701 INFO L93 Difference]: Finished difference Result 135783 states and 200992 transitions. [2025-03-08 06:27:32,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:32,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-08 06:27:32,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:32,741 INFO L225 Difference]: With dead ends: 135783 [2025-03-08 06:27:32,741 INFO L226 Difference]: Without dead ends: 46879 [2025-03-08 06:27:32,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:32,756 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 121 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:32,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 532 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46879 states. [2025-03-08 06:27:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46879 to 46877. [2025-03-08 06:27:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46877 states, 46876 states have (on average 1.4697499786671218) internal successors, (68896), 46876 states have internal predecessors, (68896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46877 states to 46877 states and 68896 transitions. [2025-03-08 06:27:33,151 INFO L78 Accepts]: Start accepts. Automaton has 46877 states and 68896 transitions. Word has length 148 [2025-03-08 06:27:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:33,152 INFO L471 AbstractCegarLoop]: Abstraction has 46877 states and 68896 transitions. [2025-03-08 06:27:33,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 46877 states and 68896 transitions. [2025-03-08 06:27:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 06:27:33,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:33,169 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] [2025-03-08 06:27:33,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:27:33,169 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:33,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:33,170 INFO L85 PathProgramCache]: Analyzing trace with hash -176986878, now seen corresponding path program 1 times [2025-03-08 06:27:33,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:33,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442600131] [2025-03-08 06:27:33,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:33,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:33,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 06:27:33,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 06:27:33,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:33,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:33,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442600131] [2025-03-08 06:27:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442600131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:33,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:33,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:33,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604015567] [2025-03-08 06:27:33,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:33,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:33,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:33,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:33,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:33,445 INFO L87 Difference]: Start difference. First operand 46877 states and 68896 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:33,558 INFO L93 Difference]: Finished difference Result 68361 states and 100458 transitions. [2025-03-08 06:27:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:33,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-08 06:27:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:33,583 INFO L225 Difference]: With dead ends: 68361 [2025-03-08 06:27:33,583 INFO L226 Difference]: Without dead ends: 23701 [2025-03-08 06:27:33,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:33,610 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 114 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:33,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 510 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:33,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23701 states. [2025-03-08 06:27:33,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23701 to 23699. [2025-03-08 06:27:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23699 states, 23698 states have (on average 1.458772892227192) internal successors, (34570), 23698 states have internal predecessors, (34570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23699 states to 23699 states and 34570 transitions. [2025-03-08 06:27:33,829 INFO L78 Accepts]: Start accepts. Automaton has 23699 states and 34570 transitions. Word has length 148 [2025-03-08 06:27:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:33,829 INFO L471 AbstractCegarLoop]: Abstraction has 23699 states and 34570 transitions. [2025-03-08 06:27:33,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 23699 states and 34570 transitions. [2025-03-08 06:27:33,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 06:27:33,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:33,838 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] [2025-03-08 06:27:33,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:27:33,839 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:33,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:33,839 INFO L85 PathProgramCache]: Analyzing trace with hash -952356728, now seen corresponding path program 1 times [2025-03-08 06:27:33,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:33,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515868904] [2025-03-08 06:27:33,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:33,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:33,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 06:27:33,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 06:27:33,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:33,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:33,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515868904] [2025-03-08 06:27:33,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515868904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:33,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:33,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:33,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576312454] [2025-03-08 06:27:33,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:33,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:33,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:33,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:33,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:33,909 INFO L87 Difference]: Start difference. First operand 23699 states and 34570 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:33,972 INFO L93 Difference]: Finished difference Result 34443 states and 50232 transitions. [2025-03-08 06:27:33,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:33,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-08 06:27:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:33,984 INFO L225 Difference]: With dead ends: 34443 [2025-03-08 06:27:33,985 INFO L226 Difference]: Without dead ends: 12105 [2025-03-08 06:27:33,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:33,999 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 118 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:33,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 496 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12105 states. [2025-03-08 06:27:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12105 to 12103. [2025-03-08 06:27:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12103 states, 12102 states have (on average 1.4470335481738557) internal successors, (17512), 12102 states have internal predecessors, (17512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12103 states to 12103 states and 17512 transitions. [2025-03-08 06:27:34,183 INFO L78 Accepts]: Start accepts. Automaton has 12103 states and 17512 transitions. Word has length 148 [2025-03-08 06:27:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:34,183 INFO L471 AbstractCegarLoop]: Abstraction has 12103 states and 17512 transitions. [2025-03-08 06:27:34,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 12103 states and 17512 transitions. [2025-03-08 06:27:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 06:27:34,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:34,189 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] [2025-03-08 06:27:34,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:27:34,189 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:34,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1087259720, now seen corresponding path program 1 times [2025-03-08 06:27:34,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:34,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065977058] [2025-03-08 06:27:34,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:34,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:34,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 06:27:34,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 06:27:34,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:34,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:34,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:34,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065977058] [2025-03-08 06:27:34,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065977058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:34,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:34,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:27:34,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115993069] [2025-03-08 06:27:34,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:34,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:27:34,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:34,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:27:34,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:27:34,468 INFO L87 Difference]: Start difference. First operand 12103 states and 17512 transitions. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:35,104 INFO L93 Difference]: Finished difference Result 36391 states and 52518 transitions. [2025-03-08 06:27:35,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:27:35,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-08 06:27:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:35,135 INFO L225 Difference]: With dead ends: 36391 [2025-03-08 06:27:35,136 INFO L226 Difference]: Without dead ends: 24347 [2025-03-08 06:27:35,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:27:35,152 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1629 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:35,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1629 Valid, 1033 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:27:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24347 states. [2025-03-08 06:27:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24347 to 23985. [2025-03-08 06:27:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23985 states, 23984 states have (on average 1.4416277518345564) internal successors, (34576), 23984 states have internal predecessors, (34576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23985 states to 23985 states and 34576 transitions. [2025-03-08 06:27:35,452 INFO L78 Accepts]: Start accepts. Automaton has 23985 states and 34576 transitions. Word has length 148 [2025-03-08 06:27:35,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:35,452 INFO L471 AbstractCegarLoop]: Abstraction has 23985 states and 34576 transitions. [2025-03-08 06:27:35,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:35,452 INFO L276 IsEmpty]: Start isEmpty. Operand 23985 states and 34576 transitions. [2025-03-08 06:27:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 06:27:35,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:35,463 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] [2025-03-08 06:27:35,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:27:35,463 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:35,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:35,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1668833256, now seen corresponding path program 1 times [2025-03-08 06:27:35,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:35,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158760893] [2025-03-08 06:27:35,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:35,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:35,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 06:27:35,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 06:27:35,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:35,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:35,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:35,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158760893] [2025-03-08 06:27:35,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158760893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:35,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:35,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:27:35,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195049227] [2025-03-08 06:27:35,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:35,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:27:35,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:35,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:27:35,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:27:35,924 INFO L87 Difference]: Start difference. First operand 23985 states and 34576 transitions. Second operand has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:36,733 INFO L93 Difference]: Finished difference Result 72416 states and 103999 transitions. [2025-03-08 06:27:36,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:27:36,734 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-08 06:27:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:36,786 INFO L225 Difference]: With dead ends: 72416 [2025-03-08 06:27:36,786 INFO L226 Difference]: Without dead ends: 48560 [2025-03-08 06:27:36,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:27:36,812 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 1742 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:36,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 1164 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:27:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48560 states. [2025-03-08 06:27:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48560 to 47397. [2025-03-08 06:27:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47397 states, 47396 states have (on average 1.4358595662081188) internal successors, (68054), 47396 states have internal predecessors, (68054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47397 states to 47397 states and 68054 transitions. [2025-03-08 06:27:37,371 INFO L78 Accepts]: Start accepts. Automaton has 47397 states and 68054 transitions. Word has length 148 [2025-03-08 06:27:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:37,371 INFO L471 AbstractCegarLoop]: Abstraction has 47397 states and 68054 transitions. [2025-03-08 06:27:37,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 47397 states and 68054 transitions. [2025-03-08 06:27:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 06:27:37,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:37,385 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] [2025-03-08 06:27:37,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:27:37,386 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:37,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:37,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1671152238, now seen corresponding path program 1 times [2025-03-08 06:27:37,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:37,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405576252] [2025-03-08 06:27:37,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:37,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:37,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 06:27:37,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 06:27:37,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:37,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:37,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:37,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405576252] [2025-03-08 06:27:37,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405576252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:37,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:37,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:37,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171265357] [2025-03-08 06:27:37,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:37,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:37,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:37,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:37,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:37,496 INFO L87 Difference]: Start difference. First operand 47397 states and 68054 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:37,644 INFO L93 Difference]: Finished difference Result 68881 states and 98896 transitions. [2025-03-08 06:27:37,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:37,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-08 06:27:37,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:37,677 INFO L225 Difference]: With dead ends: 68881 [2025-03-08 06:27:37,677 INFO L226 Difference]: Without dead ends: 24575 [2025-03-08 06:27:37,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:37,708 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 113 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:37,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 470 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24575 states. [2025-03-08 06:27:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24575 to 24573. [2025-03-08 06:27:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24573 states, 24572 states have (on average 1.421048347712844) internal successors, (34918), 24572 states have internal predecessors, (34918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24573 states to 24573 states and 34918 transitions. [2025-03-08 06:27:38,143 INFO L78 Accepts]: Start accepts. Automaton has 24573 states and 34918 transitions. Word has length 148 [2025-03-08 06:27:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:38,144 INFO L471 AbstractCegarLoop]: Abstraction has 24573 states and 34918 transitions. [2025-03-08 06:27:38,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 24573 states and 34918 transitions. [2025-03-08 06:27:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 06:27:38,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:38,152 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] [2025-03-08 06:27:38,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:27:38,153 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:38,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:38,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1228455032, now seen corresponding path program 1 times [2025-03-08 06:27:38,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:38,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394336180] [2025-03-08 06:27:38,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:38,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:38,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 06:27:38,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 06:27:38,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:38,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:38,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394336180] [2025-03-08 06:27:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394336180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:38,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:27:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799055682] [2025-03-08 06:27:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:38,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:27:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:38,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:27:38,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:27:38,491 INFO L87 Difference]: Start difference. First operand 24573 states and 34918 transitions. Second operand has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:39,568 INFO L93 Difference]: Finished difference Result 74325 states and 104900 transitions. [2025-03-08 06:27:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 06:27:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-08 06:27:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:39,617 INFO L225 Difference]: With dead ends: 74325 [2025-03-08 06:27:39,617 INFO L226 Difference]: Without dead ends: 49857 [2025-03-08 06:27:39,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:27:39,633 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 1393 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:39,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 1290 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:27:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49857 states. [2025-03-08 06:27:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49857 to 48107. [2025-03-08 06:27:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48107 states, 48106 states have (on average 1.4130877645200184) internal successors, (67978), 48106 states have internal predecessors, (67978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48107 states to 48107 states and 67978 transitions. [2025-03-08 06:27:40,096 INFO L78 Accepts]: Start accepts. Automaton has 48107 states and 67978 transitions. Word has length 148 [2025-03-08 06:27:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:40,096 INFO L471 AbstractCegarLoop]: Abstraction has 48107 states and 67978 transitions. [2025-03-08 06:27:40,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 48107 states and 67978 transitions. [2025-03-08 06:27:40,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 06:27:40,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:40,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:40,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:27:40,112 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:40,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:40,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1037976503, now seen corresponding path program 1 times [2025-03-08 06:27:40,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:40,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144664799] [2025-03-08 06:27:40,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:40,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:40,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 06:27:40,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 06:27:40,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:40,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:40,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144664799] [2025-03-08 06:27:40,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144664799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:40,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:40,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:40,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714661892] [2025-03-08 06:27:40,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:40,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:40,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:40,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:40,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:40,159 INFO L87 Difference]: Start difference. First operand 48107 states and 67978 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:40,479 INFO L93 Difference]: Finished difference Result 94653 states and 134077 transitions. [2025-03-08 06:27:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:40,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-03-08 06:27:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:40,524 INFO L225 Difference]: With dead ends: 94653 [2025-03-08 06:27:40,524 INFO L226 Difference]: Without dead ends: 47635 [2025-03-08 06:27:40,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:40,551 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 194 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:40,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 237 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:27:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47635 states. [2025-03-08 06:27:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47635 to 47635. [2025-03-08 06:27:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47635 states, 47634 states have (on average 1.4057605911743714) internal successors, (66962), 47634 states have internal predecessors, (66962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47635 states to 47635 states and 66962 transitions. [2025-03-08 06:27:40,955 INFO L78 Accepts]: Start accepts. Automaton has 47635 states and 66962 transitions. Word has length 149 [2025-03-08 06:27:40,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:40,955 INFO L471 AbstractCegarLoop]: Abstraction has 47635 states and 66962 transitions. [2025-03-08 06:27:40,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 47635 states and 66962 transitions. [2025-03-08 06:27:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 06:27:40,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:40,969 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] [2025-03-08 06:27:40,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:27:40,969 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:40,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash -564727900, now seen corresponding path program 1 times [2025-03-08 06:27:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:40,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286235628] [2025-03-08 06:27:40,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:40,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 06:27:41,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 06:27:41,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:41,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:41,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:41,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286235628] [2025-03-08 06:27:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286235628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:27:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265916873] [2025-03-08 06:27:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:41,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:27:41,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:41,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:27:41,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:27:41,336 INFO L87 Difference]: Start difference. First operand 47635 states and 66962 transitions. Second operand has 10 states, 10 states have (on average 14.9) internal successors, (149), 9 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:41,866 INFO L93 Difference]: Finished difference Result 140907 states and 197648 transitions. [2025-03-08 06:27:41,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:41,867 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 9 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-03-08 06:27:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:41,957 INFO L225 Difference]: With dead ends: 140907 [2025-03-08 06:27:41,957 INFO L226 Difference]: Without dead ends: 93461 [2025-03-08 06:27:42,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:27:42,010 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 1249 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:42,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 979 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:27:42,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93461 states. [2025-03-08 06:27:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93461 to 92019. [2025-03-08 06:27:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92019 states, 92018 states have (on average 1.401573605164207) internal successors, (128970), 92018 states have internal predecessors, (128970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92019 states to 92019 states and 128970 transitions. [2025-03-08 06:27:43,242 INFO L78 Accepts]: Start accepts. Automaton has 92019 states and 128970 transitions. Word has length 149 [2025-03-08 06:27:43,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:43,242 INFO L471 AbstractCegarLoop]: Abstraction has 92019 states and 128970 transitions. [2025-03-08 06:27:43,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 9 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 92019 states and 128970 transitions. [2025-03-08 06:27:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 06:27:43,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:43,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:43,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:27:43,276 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:43,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1842520201, now seen corresponding path program 1 times [2025-03-08 06:27:43,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:43,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809239308] [2025-03-08 06:27:43,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:43,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:43,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 06:27:43,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 06:27:43,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:43,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:43,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:43,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809239308] [2025-03-08 06:27:43,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809239308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:43,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:43,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:27:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790199325] [2025-03-08 06:27:43,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:43,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:27:43,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:43,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:27:43,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:27:43,723 INFO L87 Difference]: Start difference. First operand 92019 states and 128970 transitions. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:44,548 INFO L93 Difference]: Finished difference Result 279287 states and 390178 transitions. [2025-03-08 06:27:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:27:44,548 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-03-08 06:27:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:45,019 INFO L225 Difference]: With dead ends: 279287 [2025-03-08 06:27:45,019 INFO L226 Difference]: Without dead ends: 187349 [2025-03-08 06:27:45,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:27:45,071 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1752 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:45,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 1026 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:27:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187349 states. [2025-03-08 06:27:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187349 to 182939. [2025-03-08 06:27:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182939 states, 182938 states have (on average 1.396232603395686) internal successors, (255424), 182938 states have internal predecessors, (255424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182939 states to 182939 states and 255424 transitions. [2025-03-08 06:27:47,056 INFO L78 Accepts]: Start accepts. Automaton has 182939 states and 255424 transitions. Word has length 150 [2025-03-08 06:27:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:47,056 INFO L471 AbstractCegarLoop]: Abstraction has 182939 states and 255424 transitions. [2025-03-08 06:27:47,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:47,057 INFO L276 IsEmpty]: Start isEmpty. Operand 182939 states and 255424 transitions. [2025-03-08 06:27:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 06:27:47,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:47,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:47,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:27:47,121 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:47,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1827516355, now seen corresponding path program 1 times [2025-03-08 06:27:47,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:47,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151537433] [2025-03-08 06:27:47,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:47,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:47,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 06:27:47,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 06:27:47,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:47,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:47,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:47,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151537433] [2025-03-08 06:27:47,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151537433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:47,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455587568] [2025-03-08 06:27:47,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:47,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:47,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:47,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:47,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:47,221 INFO L87 Difference]: Start difference. First operand 182939 states and 255424 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:48,272 INFO L93 Difference]: Finished difference Result 268383 states and 374946 transitions. [2025-03-08 06:27:48,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:48,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-03-08 06:27:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:48,363 INFO L225 Difference]: With dead ends: 268383 [2025-03-08 06:27:48,363 INFO L226 Difference]: Without dead ends: 94363 [2025-03-08 06:27:48,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:48,413 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 87 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:48,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 435 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94363 states. [2025-03-08 06:27:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94363 to 94361. [2025-03-08 06:27:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94361 states, 94360 states have (on average 1.3829376854599407) internal successors, (130494), 94360 states have internal predecessors, (130494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94361 states to 94361 states and 130494 transitions. [2025-03-08 06:27:49,463 INFO L78 Accepts]: Start accepts. Automaton has 94361 states and 130494 transitions. Word has length 150 [2025-03-08 06:27:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:49,463 INFO L471 AbstractCegarLoop]: Abstraction has 94361 states and 130494 transitions. [2025-03-08 06:27:49,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 94361 states and 130494 transitions. [2025-03-08 06:27:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 06:27:49,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:49,491 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] [2025-03-08 06:27:49,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:27:49,491 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:49,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:49,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1462391833, now seen corresponding path program 1 times [2025-03-08 06:27:49,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:49,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735573129] [2025-03-08 06:27:49,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:49,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 06:27:49,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 06:27:49,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:49,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:49,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-08 06:27:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735573129] [2025-03-08 06:27:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735573129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:49,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:49,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:27:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165535474] [2025-03-08 06:27:49,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:49,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:27:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:49,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:27:49,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:27:49,690 INFO L87 Difference]: Start difference. First operand 94361 states and 130494 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:50,627 INFO L93 Difference]: Finished difference Result 181731 states and 251706 transitions. [2025-03-08 06:27:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:50,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-03-08 06:27:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:50,710 INFO L225 Difference]: With dead ends: 181731 [2025-03-08 06:27:50,710 INFO L226 Difference]: Without dead ends: 94363 [2025-03-08 06:27:50,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:27:50,738 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 807 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:50,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1138 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:27:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94363 states. [2025-03-08 06:27:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94363 to 93381. [2025-03-08 06:27:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93381 states, 93380 states have (on average 1.383015635039623) internal successors, (129146), 93380 states have internal predecessors, (129146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93381 states to 93381 states and 129146 transitions. [2025-03-08 06:27:51,795 INFO L78 Accepts]: Start accepts. Automaton has 93381 states and 129146 transitions. Word has length 151 [2025-03-08 06:27:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:51,795 INFO L471 AbstractCegarLoop]: Abstraction has 93381 states and 129146 transitions. [2025-03-08 06:27:51,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 93381 states and 129146 transitions. [2025-03-08 06:27:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 06:27:51,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:51,840 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] [2025-03-08 06:27:51,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:27:51,840 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:51,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1544982235, now seen corresponding path program 1 times [2025-03-08 06:27:51,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:51,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745066629] [2025-03-08 06:27:51,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:51,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 06:27:51,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 06:27:51,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:51,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:52,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:52,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745066629] [2025-03-08 06:27:52,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745066629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:52,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:52,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:27:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22423064] [2025-03-08 06:27:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:52,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:27:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:52,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:27:52,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:27:52,103 INFO L87 Difference]: Start difference. First operand 93381 states and 129146 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:52,939 INFO L93 Difference]: Finished difference Result 227310 states and 314277 transitions. [2025-03-08 06:27:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:27:52,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-03-08 06:27:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:53,387 INFO L225 Difference]: With dead ends: 227310 [2025-03-08 06:27:53,388 INFO L226 Difference]: Without dead ends: 136399 [2025-03-08 06:27:53,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:27:53,422 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1241 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:53,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 937 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:27:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136399 states. [2025-03-08 06:27:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136399 to 92477. [2025-03-08 06:27:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92477 states, 92476 states have (on average 1.3828669060080454) internal successors, (127882), 92476 states have internal predecessors, (127882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92477 states to 92477 states and 127882 transitions. [2025-03-08 06:27:54,501 INFO L78 Accepts]: Start accepts. Automaton has 92477 states and 127882 transitions. Word has length 151 [2025-03-08 06:27:54,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:54,501 INFO L471 AbstractCegarLoop]: Abstraction has 92477 states and 127882 transitions. [2025-03-08 06:27:54,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 92477 states and 127882 transitions. [2025-03-08 06:27:54,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 06:27:54,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:54,528 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] [2025-03-08 06:27:54,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:27:54,528 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:54,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1245963849, now seen corresponding path program 1 times [2025-03-08 06:27:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:54,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932492987] [2025-03-08 06:27:54,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:54,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:54,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 06:27:54,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 06:27:54,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:54,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:54,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:54,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932492987] [2025-03-08 06:27:54,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932492987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:54,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:54,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:54,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175068876] [2025-03-08 06:27:54,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:54,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:54,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:54,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:54,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:54,565 INFO L87 Difference]: Start difference. First operand 92477 states and 127882 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:54,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:54,890 INFO L93 Difference]: Finished difference Result 183558 states and 254265 transitions. [2025-03-08 06:27:54,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:54,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-03-08 06:27:54,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:54,984 INFO L225 Difference]: With dead ends: 183558 [2025-03-08 06:27:54,984 INFO L226 Difference]: Without dead ends: 91562 [2025-03-08 06:27:55,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:55,044 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 148 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:55,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 289 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:27:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91562 states. [2025-03-08 06:27:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91562 to 91562. [2025-03-08 06:27:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91562 states, 91561 states have (on average 1.3807516300608338) internal successors, (126423), 91561 states have internal predecessors, (126423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91562 states to 91562 states and 126423 transitions. [2025-03-08 06:27:56,069 INFO L78 Accepts]: Start accepts. Automaton has 91562 states and 126423 transitions. Word has length 152 [2025-03-08 06:27:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:56,071 INFO L471 AbstractCegarLoop]: Abstraction has 91562 states and 126423 transitions. [2025-03-08 06:27:56,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 91562 states and 126423 transitions. [2025-03-08 06:27:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 06:27:56,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:56,122 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] [2025-03-08 06:27:56,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:27:56,122 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:27:56,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1090580439, now seen corresponding path program 1 times [2025-03-08 06:27:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:56,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278941627] [2025-03-08 06:27:56,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:56,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:56,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 06:27:56,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 06:27:56,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:56,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:56,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:56,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278941627] [2025-03-08 06:27:56,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278941627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:56,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:56,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:27:56,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886819505] [2025-03-08 06:27:56,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:56,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:27:56,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:56,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:27:56,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:27:56,625 INFO L87 Difference]: Start difference. First operand 91562 states and 126423 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)